Construction of a class of linear codes with at most three-weight and the application

Linear codes are widely studied due to their important applications in secret sharing schemes, authentication codes, association schemes and strongly regular graphs, etc. In this paper, firstly, a class of three-weight linear is constructed by selecting new defining set, whose weight distributions determined exponential sums. Results show that almost all the minimal thus can be used construct with sound access structures. Particularly, projective two-weight obtained based on which graph parameters designed.